A new lift-and-project operator
نویسندگان
چکیده
In this paper, we analyze the strength of split cuts in a lift-and-project framework. We first observe that the Lovász-Schrijver and Sherali-Adams lift-and-project operator hierarchies can be viewed as applying specific 0-1 split cuts to an appropriate extended formulation and demonstrate how to strengthen these hierarchies using additional split cuts. More precisely, we define a new operator that adds all 0-1 split cuts to the extended formulation. For 0-1 mixed-integer sets with k binary variables, this new operator is guaranteed to obtain the integer hull in dk/2e steps compared to k steps for the Lovász-Schrijver or the SheraliAdams operator. We also present computational results on the stable set problem with our new operator.
منابع مشابه
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
We consider lift-and-project methods for combinatorial optimization problems and focus mostly on those lift-and-project methods which generate polyhedral relaxations of the convex hull of integer solutions. We introduce many new variants of Sherali–Adams and Bienstock– Zuckerberg operators. These new operators fill the spectrum of polyhedral lift-and-project operators in a way which makes all o...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملOn the polyhedral lift-and-project methods and the fractional stable set polytope
We study two polyhedral lift-and-project operators (originally proposed by Lovász and Schrijver in 1991) applied to the fractional stable set polytopes. First, we provide characterizations of all valid inequalities generated by these operators. Then, we present some seven-node graphs on which the operator enforcing the symmetry of the matrix variable is strictly stronger on the odd-cycle polyto...
متن کاملOn the Relationship between Disjunctive Relaxations and Minors in Packing and Covering Problems
In 2002, Aguilera et al. analyzed the performance of the disjunctive lift-and-project operator defined by Balas, Ceria and Cornuéjols on covering and packing polyhedra, in the context of blocking and antiblocking duality. Their results generalize Lovász’s Perfect Graph Theorem and a theorem of Lehman on ideal clutters. This study motivated many authors to work on the same ideas, providing alter...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 257 شماره
صفحات -
تاریخ انتشار 2017